#include <iostream>

using namespace std;

const int N = 12;

struct node{
	int x, y;
}a[N];
int n, m, k;
int cnt;
bool is_cover[N][N];

bool dfs(int i, int j)
{
	if(j > m) 
	{
		j = 1; i++;
	}
	if(i > n)
	{
		return cnt == n * m;
	}
	if(is_cover[i][j]) return dfs(i, j + 1);
	
}

int main()
{
	cin >> n >> m >> k;
	
	for(int i = 1; i <= k; i++)
	{
		cin >> a[i].x >> a[i].y;
	}
	
	if(dfs(1, 1)) cout << "Yes" << endl;
	else cout << "No" << endl;
	
	return 0;
} 
